________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:22:14
Input Data from:  dataset153.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0705
Average f[i]   :5000
Average g[i,j] :2013,88888888889
Total demand   :10740
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	0	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 18
> Selected Move:	910	1	-1	4	10500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 910


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 81
> Selected Move:	1800	1	-1	12	16500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0    >new incumb.: 1800


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 97
> Selected Move:	2430	1	-1	15	23000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0    >new incumb.: 2430


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 94
> Selected Move:	2430	3	4	10	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 92
> Selected Move:	2430	3	1	9	25000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  3  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 61
> Selected Move:	2430	4	9	10	24600


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  3  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 64
> Selected Move:	2430	4	10	12	24400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  1  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 63
> Selected Move:	2430	4	12	15	23900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  1  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 78
> Selected Move:	2390	3	10	4	24400


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 74
> Selected Move:	2390	4	15	12	24900


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 71
> Selected Move:	2330	3	9	19	23900


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 77
> Selected Move:	2350	3	2	8	24900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 66
> Selected Move:	2350	4	12	8	24200


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 71
> Selected Move:	2380	3	8	1	22500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 89
> Selected Move:	2430	3	15	7	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 97
> Selected Move:	2430	3	4	10	21000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 94
> Selected Move:	2600	1	-1	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0  1    >new incumb.: 2600


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 85
> Selected Move:	2670	3	7	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1    >new incumb.: 2670


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 98
> Selected Move:	2670	3	10	4	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 96
> Selected Move:	2610	3	2	10	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 90
> Selected Move:	2650	3	4	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 102
> Selected Move:	2650	3	12	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 83
> Selected Move:	2610	3	8	2	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 100
> Selected Move:	2670	3	14	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 94
> Selected Move:	2610	3	15	4	24000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 102
> Selected Move:	2610	3	10	14	24500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 104
> Selected Move:	2610	3	4	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 95
> Selected Move:	2540	3	14	6	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 87
> Selected Move:	2540	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 97
> Selected Move:	2540	3	4	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 94
> Selected Move:	2540	3	12	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 102
> Selected Move:	2600	3	6	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 96
> Selected Move:	2530	3	18	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 96
> Selected Move:	2480	3	16	5	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 94
> Selected Move:	2480	3	10	4	25000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 103
> Selected Move:	2540	3	5	6	24000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 101
> Selected Move:	2540	3	2	8	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 104
> Selected Move:	2540	3	4	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 93
> Selected Move:	2493	3	6	12	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 92
> Selected Move:	2450	3	12	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 101
> Selected Move:	2488	3	10	14	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 103
> Selected Move:	2490	3	8	12	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 107
> Selected Move:	2443	3	14	7	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 102
> Selected Move:	2420	3	12	14	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 105
> Selected Move:	2420	3	4	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 103
> Selected Move:	2530	3	17	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 47 #######################


> Neighbours evaluated; 85
> Selected Move:	2535	3	14	12	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 48 #######################


> Neighbours evaluated; 69
> Selected Move:	2525	3	7	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 49 #######################


> Neighbours evaluated; 83
> Selected Move:	2555	3	6	4	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 50 #######################


> Neighbours evaluated; 88
> Selected Move:	2500	3	12	6	25000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 51 #######################


> Neighbours evaluated; 103
> Selected Move:	2520	3	4	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 52 #######################


> Neighbours evaluated; 90
> Selected Move:	2450	3	7	14	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 53 #######################


> Neighbours evaluated; 102
> Selected Move:	2380	3	14	3	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 54 #######################


> Neighbours evaluated; 96
> Selected Move:	2430	3	2	7	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 55 #######################


> Neighbours evaluated; 86
> Selected Move:	2380	3	6	2	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 56 #######################


> Neighbours evaluated; 92
> Selected Move:	2400	3	7	17	23500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 57 #######################


> Neighbours evaluated; 100
> Selected Move:	2400	3	2	8	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 58 #######################


> Neighbours evaluated; 92
> Selected Move:	2400	3	8	12	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 59 #######################


> Neighbours evaluated; 98
> Selected Move:	2400	3	10	2	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 60 #######################


> Neighbours evaluated; 91
> Selected Move:	2400	3	2	4	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 61 #######################


> Neighbours evaluated; 101
> Selected Move:	2400	3	12	2	24000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 62 #######################


> Neighbours evaluated; 100
> Selected Move:	2525	3	3	15	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 63 #######################


> Neighbours evaluated; 101
> Selected Move:	2470	3	4	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 64 #######################


> Neighbours evaluated; 96
> Selected Move:	2470	3	2	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 65 #######################


> Neighbours evaluated; 104
> Selected Move:	2443	3	6	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 66 #######################


> Neighbours evaluated; 105
> Selected Move:	2400	3	14	12	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 67 #######################


> Neighbours evaluated; 110
> Selected Move:	2405	3	10	2	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 68 #######################


> Neighbours evaluated; 92
> Selected Move:	2390	3	15	9	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 69 #######################


> Neighbours evaluated; 101
> Selected Move:	2443	3	19	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 91
> Selected Move:	2570	3	12	14	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 71 #######################


> Neighbours evaluated; 99
> Selected Move:	2540	3	14	6	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 72 #######################


> Neighbours evaluated; 103
> Selected Move:	2540	3	9	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 73 #######################


> Neighbours evaluated; 97
> Selected Move:	2518	3	6	14	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 74 #######################


> Neighbours evaluated; 104
> Selected Move:	2475	3	14	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 75 #######################


> Neighbours evaluated; 100
> Selected Move:	2510	3	12	9	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 76 #######################


> Neighbours evaluated; 104
> Selected Move:	2540	3	10	6	25000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 77 #######################


> Neighbours evaluated; 110
> Selected Move:	2433	3	6	14	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 78 #######################


> Neighbours evaluated; 107
> Selected Move:	2400	3	14	3	25000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 79 #######################


> Neighbours evaluated; 104
> Selected Move:	2400	3	4	10	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 80 #######################


> Neighbours evaluated; 100
> Selected Move:	2420	3	3	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 81 #######################


> Neighbours evaluated; 96
> Selected Move:	2390	3	2	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 82 #######################


> Neighbours evaluated; 111
> Selected Move:	2405	3	9	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 83 #######################


> Neighbours evaluated; 104
> Selected Move:	2448	3	17	12	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 84 #######################


> Neighbours evaluated; 70
> Selected Move:	2590	3	15	14	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 85 #######################


> Neighbours evaluated; 94
> Selected Move:	2508	3	14	4	26500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 86 #######################


> Neighbours evaluated; 97
> Selected Move:	2480	3	10	6	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 87 #######################


> Neighbours evaluated; 101
> Selected Move:	2460	3	6	14	27000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 88 #######################


> Neighbours evaluated; 93
> Selected Move:	2410	3	12	6	26000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 89 #######################


> Neighbours evaluated; 106
> Selected Move:	2393	3	14	2	25500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 90 #######################


> Neighbours evaluated; 108
> Selected Move:	2420	3	7	12	26000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 91 #######################


> Neighbours evaluated; 100
> Selected Move:	2415	3	2	10	26000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 92 #######################


> Neighbours evaluated; 98
> Selected Move:	2410	3	4	14	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 93 #######################


> Neighbours evaluated; 97
> Selected Move:	2405	3	12	8	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 94 #######################


> Neighbours evaluated; 87
> Selected Move:	2360	3	8	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 95 #######################


> Neighbours evaluated; 105
> Selected Move:	2390	3	6	9	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 96 #######################


> Neighbours evaluated; 105
> Selected Move:	2390	3	10	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 97 #######################


> Neighbours evaluated; 103
> Selected Move:	2390	3	4	7	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 98 #######################


> Neighbours evaluated; 95
> Selected Move:	2390	3	14	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 99 #######################


> Neighbours evaluated; 103
> Selected Move:	2390	3	7	2	24500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 100 #######################


> Neighbours evaluated; 96
> Selected Move:	2450	3	9	18	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 101 #######################


> Neighbours evaluated; 100
> Selected Move:	2390	3	18	11	24500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 102 #######################


> Neighbours evaluated; 103
> Selected Move:	2390	3	4	10	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 103 #######################


> Neighbours evaluated; 106
> Selected Move:	2390	3	2	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 104 #######################


> Neighbours evaluated; 104
> Selected Move:	2390	3	8	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 105 #######################


> Neighbours evaluated; 102
> Selected Move:	2390	3	10	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 106 #######################


> Neighbours evaluated; 86
> Selected Move:	2360	3	11	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 107 #######################


> Neighbours evaluated; 87
> Selected Move:	2360	3	12	4	24500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 108 #######################


> Neighbours evaluated; 99
> Selected Move:	2400	3	7	16	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 109 #######################


> Neighbours evaluated; 102
> Selected Move:	2380	3	16	8	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 110 #######################


> Neighbours evaluated; 96
> Selected Move:	2410	3	2	12	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 111 #######################


> Neighbours evaluated; 102
> Selected Move:	2408	3	4	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 112 #######################


> Neighbours evaluated; 95
> Selected Move:	2360	3	8	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 113 #######################


> Neighbours evaluated; 110
> Selected Move:	2360	3	12	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 114 #######################


> Neighbours evaluated; 109
> Selected Move:	2355	3	14	15	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 115 #######################


> Neighbours evaluated; 109
> Selected Move:	2355	3	6	14	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 116 #######################


> Neighbours evaluated; 106
> Selected Move:	2335	3	4	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 117 #######################


> Neighbours evaluated; 91
> Selected Move:	2370	3	15	9	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 118 #######################


> Neighbours evaluated; 98
> Selected Move:	2390	3	14	10	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 119 #######################


> Neighbours evaluated; 96
> Selected Move:	2390	3	2	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 120 #######################


> Neighbours evaluated; 102
> Selected Move:	2390	3	4	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 121 #######################


> Neighbours evaluated; 97
> Selected Move:	2418	3	19	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 122 #######################


> Neighbours evaluated; 98
> Selected Move:	2420	3	8	12	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 123 #######################


> Neighbours evaluated; 94
> Selected Move:	2418	3	10	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 124 #######################


> Neighbours evaluated; 92
> Selected Move:	2415	3	9	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 125 #######################


> Neighbours evaluated; 105
> Selected Move:	2395	3	6	14	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 126 #######################


> Neighbours evaluated; 106
> Selected Move:	2310	3	4	9	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 127 #######################


> Neighbours evaluated; 88
> Selected Move:	2305	3	2	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 128 #######################


> Neighbours evaluated; 98
> Selected Move:	2390	3	14	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 129 #######################


> Neighbours evaluated; 98
> Selected Move:	2343	3	9	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 130 #######################


> Neighbours evaluated; 99
> Selected Move:	2340	3	10	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 131 #######################


> Neighbours evaluated; 86
> Selected Move:	2315	3	5	18	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 132 #######################


> Neighbours evaluated; 90
> Selected Move:	2310	3	2	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 133 #######################


> Neighbours evaluated; 106
> Selected Move:	2310	3	12	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 134 #######################


> Neighbours evaluated; 103
> Selected Move:	2310	3	10	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 135 #######################


> Neighbours evaluated; 99
> Selected Move:	2300	3	18	9	24000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,31

## ITERATION 136 #######################


> Neighbours evaluated; 96
> Selected Move:	2360	3	6	7	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 137 #######################


> Neighbours evaluated; 90
> Selected Move:	2360	3	9	10	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 138 #######################


> Neighbours evaluated; 85
> Selected Move:	2380	3	7	8	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 139 #######################


> Neighbours evaluated; 75
> Selected Move:	2355	3	2	15	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 86
> Selected Move:	2330	3	8	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 90
> Selected Move:	2330	3	10	2	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 142 #######################


> Neighbours evaluated; 94
> Selected Move:	2250	3	17	10	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 143 #######################


> Neighbours evaluated; 78
> Selected Move:	2398	3	15	12	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 144 #######################


> Neighbours evaluated; 81
> Selected Move:	2420	3	2	7	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 145 #######################


> Neighbours evaluated; 67
> Selected Move:	2403	3	12	14	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 146 #######################


> Neighbours evaluated; 85
> Selected Move:	2340	3	3	15	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 147 #######################


> Neighbours evaluated; 84
> Selected Move:	2380	2	14	-1	21500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 148 #######################


> Neighbours evaluated; 94
> Selected Move:	2380	3	7	12	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 149 #######################


> Neighbours evaluated; 96
> Selected Move:	2350	3	1	8	23700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 150 #######################


> Neighbours evaluated; 78
> Selected Move:	2350	4	8	10	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 151 #######################


> Neighbours evaluated; 68
> Selected Move:	2350	4	10	12	24400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  1  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 152 #######################


> Neighbours evaluated; 68
> Selected Move:	2350	4	12	15	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  1  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 153 #######################


> Neighbours evaluated; 77
> Selected Move:	2350	3	10	4	24400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 154 #######################


> Neighbours evaluated; 74
> Selected Move:	2330	3	8	2	23400


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 155 #######################


> Neighbours evaluated; 87
> Selected Move:	2330	4	15	2	24700


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 156 #######################


> Neighbours evaluated; 75
> Selected Move:	2330	4	2	4	24200


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 157 #######################


> Neighbours evaluated; 83
> Selected Move:	2333	3	19	9	25200


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 158 #######################


> Neighbours evaluated; 74
> Selected Move:	2330	3	15	17	22700


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 159 #######################


> Neighbours evaluated; 94
> Selected Move:	2330	4	4	2	23200


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 160 #######################


> Neighbours evaluated; 94
> Selected Move:	2330	4	2	9	23000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  3  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 161 #######################


> Neighbours evaluated; 93
> Selected Move:	2330	4	9	12	22400


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 162 #######################


> Neighbours evaluated; 92
> Selected Move:	2330	4	12	17	23500


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 163 #######################


> Neighbours evaluated; 95
> Selected Move:	2330	3	4	10	23000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 164 #######################


> Neighbours evaluated; 93
> Selected Move:	2330	4	17	2	22700


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 165 #######################


> Neighbours evaluated; 93
> Selected Move:	2381	3	17	15	25200


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 166 #######################


> Neighbours evaluated; 86
> Selected Move:	2350	3	2	8	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 167 #######################


> Neighbours evaluated; 77
> Selected Move:	2350	4	8	15	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  1  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 168 #######################


> Neighbours evaluated; 81
> Selected Move:	2310	3	8	7	24400


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  1  1  0  1  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 169 #######################


> Neighbours evaluated; 70
> Selected Move:	2370	3	15	1	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 170 #######################


> Neighbours evaluated; 93
> Selected Move:	2370	3	10	4	22500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 171 #######################


> Neighbours evaluated; 104
> Selected Move:	2330	3	9	13	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 172 #######################


> Neighbours evaluated; 102
> Selected Move:	2330	3	4	10	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 173 #######################


> Neighbours evaluated; 95
> Selected Move:	2310	3	13	15	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 174 #######################


> Neighbours evaluated; 88
> Selected Move:	2350	3	7	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 175 #######################


> Neighbours evaluated; 94
> Selected Move:	2350	3	10	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 104
> Selected Move:	2310	3	8	7	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 177 #######################


> Neighbours evaluated; 99
> Selected Move:	2505	1	-1	19	28000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 178 #######################


> Neighbours evaluated; 93
> Selected Move:	2450	3	7	2	27500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 179 #######################


> Neighbours evaluated; 93
> Selected Move:	2550	3	4	10	27000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 180 #######################


> Neighbours evaluated; 100
> Selected Move:	2510	3	12	6	26000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 181 #######################


> Neighbours evaluated; 101
> Selected Move:	2543	3	2	7	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 182 #######################


> Neighbours evaluated; 95
> Selected Move:	2450	3	7	12	27000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 183 #######################


> Neighbours evaluated; 97
> Selected Move:	2463	3	6	14	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 184 #######################


> Neighbours evaluated; 110
> Selected Move:	2460	3	15	4	26500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 185 #######################


> Neighbours evaluated; 101
> Selected Move:	2500	3	14	8	27000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 101
> Selected Move:	2440	3	4	14	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 98
> Selected Move:	2418	3	14	6	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 188 #######################


> Neighbours evaluated; 89
> Selected Move:	2330	3	6	15	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 72
> Selected Move:	2358	3	8	4	27500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 85
> Selected Move:	2405	3	12	2	26500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 191 #######################


> Neighbours evaluated; 101
> Selected Move:	2393	3	15	7	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 192 #######################


> Neighbours evaluated; 104
> Selected Move:	2390	3	4	12	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 193 #######################


> Neighbours evaluated; 75
> Selected Move:	2385	3	7	14	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 194 #######################


> Neighbours evaluated; 101
> Selected Move:	2335	3	12	7	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 93
> Selected Move:	2313	3	7	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 102
> Selected Move:	2360	3	14	3	25000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 103
> Selected Move:	2380	3	10	6	25000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 198 #######################


> Neighbours evaluated; 109
> Selected Move:	2325	3	3	14	25500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 199 #######################


> Neighbours evaluated; 106
> Selected Move:	2298	3	2	8	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 102
> Selected Move:	2290	3	8	12	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 201 #######################


> Neighbours evaluated; 97
> Selected Move:	2270	2	6	-1	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 101
> Selected Move:	2300	3	14	8	22000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 203 #######################


> Neighbours evaluated; 100
> Selected Move:	2300	3	0	15	24000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  0  1  0  0  2  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 204 #######################


> Neighbours evaluated; 73
> Selected Move:	2310	3	8	7	23500


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  1  0  0  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 205 #######################


> Neighbours evaluated; 79
> Selected Move:	2310	4	15	4	24200


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 206 #######################


> Neighbours evaluated; 74
> Selected Move:	2310	4	4	7	24200


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 207 #######################


> Neighbours evaluated; 72
> Selected Move:	2310	4	7	12	23900


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  2  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 208 #######################


> Neighbours evaluated; 75
> Selected Move:	2360	3	12	0	22000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 209 #######################


> Neighbours evaluated; 101
> Selected Move:	2310	3	1	12	24400


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  3  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 210 #######################


> Neighbours evaluated; 71
> Selected Move:	2310	4	12	4	24700


> New Y[]: 
	
	 2  0  0  0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 211 #######################


> Neighbours evaluated; 71
> Selected Move:	2310	4	4	7	24000


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 212 #######################


> Neighbours evaluated; 76
> Selected Move:	2310	4	7	15	23900


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 213 #######################


> Neighbours evaluated; 82
> Selected Move:	2310	3	4	10	23400


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  1  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 214 #######################


> Neighbours evaluated; 71
> Selected Move:	2330	3	7	2	22900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  1  0  1  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 215 #######################


> Neighbours evaluated; 92
> Selected Move:	2473	1	-1	17	26900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  1  0  1  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 216 #######################


> Neighbours evaluated; 105
> Selected Move:	2390	3	15	14	26000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  1  0  1  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 217 #######################


> Neighbours evaluated; 111
> Selected Move:	2375	3	14	18	26700


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 218 #######################


> Neighbours evaluated; 110
> Selected Move:	2358	3	18	5	26200


> New Y[]: 
	
	 2  0  1  0  0  3  0  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,205
________________________________________________________________

Best solution found: 2670
Run Termination time: 31.01.2010 11:25:58
Run duration: 00:03:44.1875000
________________________________________________________________
